How Different Can Two Intersecting Families Be?
نویسندگان
چکیده
منابع مشابه
How Different Can Two Intersecting Families Be?
To measure the difference between two intersecting families F ,G ⊆ 2[n] we introduce the quantity D(F ,G) = |{(F,G) : F ∈ F , G ∈ G, F ∩ G = ∅}|. We prove that if F is k-uniform and G is l-uniform, then for large enough n and for any i 6= j Fi = {F ⊆ [n] : i ∈ F, |F | = k} and Fj = {F ⊆ [n] : j ∈ F, |F | = l} form an optimal pair of families (that is D(F ,G) ≤ D(Fi,Fj) for all uniform and inter...
متن کاملHow can Alzheimer's Patients be Helped?
پرستاری از بیمار مبتلا به بیماری آلزایمر چندان ساده نیست. حتی اگر از این امر که اختلال رفتاری فرد نشانه ای از بیماری اوست، آگاه باشید، اکثر مواقع نمی دانید که چگونه باید با او رفتار کنید. در این مقاله روشهای مناسبی ارائه گردیده تا خانواده بیمار بتواند با ۱۰ اختلال رفتاری شایع در بیماران مبتلا بدون احساس ناامیدی و خشم سازگاری یابند.
متن کاملHow Small Can Be?
We consider the following shadow system of Gierer-Meinhardt model 8 < : A > 0; A x (0; t) = A x (1; t) = 0: where 1 < p < +1; 2r p?1 > s + 1; s 0 and > 0. We show that the monotone steady-state solution exists and linearly stable if and only if < p p ? 1 : Uniqueness and transversality of Hopf bifurcations and extension to higher dimensions are also discussed.
متن کاملChain Intersecting Families
Let F be a family of subsets of an n-element set. F is called (p,q)-chain intersecting if it does not contain chains A1 ( A2 ( · · · ( Ap and B1 ( B2 ( · · · ( Bq with Ap∩Bq = ∅. The maximum size of these families is determined in this paper. Similarly to the p = q = 1 special case (intersecting families) this depends on the notion of r-complementing-chain-pair-free families, where r = p + q − ...
متن کاملRegular Intersecting Families
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families F of k-element subsets of [n] := {1, . . . , n}, such that every element of [n] lies in the same (or approximately the same) number of members of F . In particular, we show that we can guarantee |F| = o( ( n−1 k−1 ) ) if and only if k = o(n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2005
ISSN: 1077-8926
DOI: 10.37236/1921